منابع مشابه
Computing Illumination from Area Light Sources by Approximate Contour Integration
A new method using approximate contour integration to accurately compute direct illumination from diffuse area sources in presence of curved obstacles is presented. All visibility tests are done using ray tracing so the method can be applied to a large class of objects. Computation of illumination on a pixel by pixel basis is necessary to accurately capture sharp shadows. However in soft penumb...
متن کاملGlobal Diiuse Illumination with Polygonal Light Sources
We present an object-space algorithm for global illumination of polygonal scenes containing diiuse area light sources. Our method works within a progressive-reenement radiosity framework. Starting with a minimal scene mesh, we subdivide elements along shadow boundaries and where otherwise needed to capture intensity gradations accurately. Intensities at mesh points are computed by a method that...
متن کاملIrregular, Unknown Light Sources In Dynamic Global Illumination
The goal in global illumination solutions for dynamic environments is to update a scene based on past scenes. Current state of the art solutions are either not applicable, or unduly complex, when there are large changes in the illumination of unbounded number of objects. Such changes may be caused by the appearance of unexpected (at modeling time), irregular light sources. We define a subset of...
متن کاملUsing Near-Field Light Sources to Separate Illumination from BRDF
Simultaneous estimation of lighting and BRDF from multi-view images is an interesting problem in computer vision. It allows for exciting applications, such as flexible relighting in post-production, without recapturing the scene. Unfortunately, the estimation problem is made difficult because lighting and BRDF have closely entangled effects in the input images. This paper presents an algorithm ...
متن کاملOnline Concealed Correlation by Boundedly Rational Players
In a repeated game with perfect monitoring, correlation among a group of players may evolve in the common course of play (online correlation). Bounds on the complexity of the strategies that players use may enable a group of players to conceal such a correlation from their opponent. The feasibility of such “online concealed correlation” is quantified by the individually rational payoff of the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JOURNAL OF THE ILLUMINATING ENGINEERING INSTITUTE OF JAPAN
سال: 1927
ISSN: 0019-2341,1349-838X,2185-1506
DOI: 10.2150/jieij1917.11.5_233